Reviving Partial Order Planning

نویسندگان

  • XuanLong Nguyen
  • Subbarao Kambhampati
چکیده

This paper challenges the prevailing pessimism about the scale-up ability of partial order planners (POP) by presenting several novel heuristic control techniques that make the PO planners competitive with the state of the art plan synthesis algorithms. Our critical insight is that the techniques responsible for the efficiency of the currently successful planners–viz., distance based heuristics, reachability analysis and disjunctive constraint handling– can also be adapted to dramatically improve the efficiency of the POP algorithm. Our empirical studies demonstrate that in parallel domains, RePOP, a planner based on our ideas, convincingly outperforms Graphplan (which has hither-to been considered to be the best approach for synthesizing parallel plans). The plans generated by RePOP are also significantly better than those generated by Graphplan and state search planners in terms of execution flexibility.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comparing Partial Order Planning and Task Reduction Planning: A preliminary report

Although task reduction (HTN) planning historically preceded partial order (PO) planning, and is understood to be more general than the latter, very little analysis has been done regarding its performance. Part of the reason for this has been the lack of systematic understanding of the functionalities provided by HTN planning over and above that of partial order planning. HTN planning has been ...

متن کامل

Total - Order and Partial - Order Planning : A Comparative

For many years, the intuitions underlying partial-order planning were largely taken for granted. Only in the past few years has there been renewed interest in the fundamental principles underlying this paradigm. In this paper, we present a rigorous comparative analysis of partial-order and total-order planning by focusing on two speciic planners that can be directly compared. We show that there...

متن کامل

Total-Order and Partial-Order Planning: A Comparative Analysis

For many years, the intuitions underlying partial-order planning were largely taken for granted. Only in the past few years has there been renewed interest in the fundamental principles underlying this paradigm. In this paper, we present a rigorous comparative analysis of partial-order and total-order planning by focusing on two speci c planners that can be directly compared. We show that there...

متن کامل

Using Partial Order Plans for Project Management

We present a framework in which partial order plans are used for project management tasks where the dependency between each sub task and employee can be observed. For this purpose, extending the resource conscious linear logic planning, we establish an explicit correspondence between multiplicative exponential linear logic proofs and partial order plans. We express planning problems as formulae...

متن کامل

About Partial Order Reduction in Planning and Computer Aided Verification

Partial order reduction is a state space pruning approach that has been originally introduced in computer aided verification. Recently, various partial order reduction techniques have also been proposed for planning. Despite very similar underlying ideas, the relevant literature from computer aided verification has hardly been analyzed in the planning area so far, and it is unclear how these te...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2001